/*-
 * Copyright (c) 2006, 2007 FTS Team
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 4. Neither the name of the FTS Team nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 *      Passage.cpp
 *
 * $FTS$
 */

#include <Passage.hpp>

namespace FTSS // FullTextSearchSystem
{

const UINT_16 WordEntryPos::npos = (UINT_16)-1;

const UINT_32 Passage::npos = UINT_32(-1);

Passage::Passage(const Passage & oRhs)
{
	max_pos   = oRhs.max_pos;
	positions = oRhs.positions;
	rank      = oRhs.rank;
	idf       = oRhs.idf;

	min_bp_pos = oRhs.min_bp_pos;
	max_bp_pos = oRhs.max_bp_pos;

	base_points_pos = new UINT_32[max_pos];
	word_ranks      = new W_FLOAT[max_pos];
	for (UINT_32 iI = 0; iI < max_pos; ++iI)
	{
		base_points_pos[iI] = oRhs.base_points_pos[iI];
		word_ranks[iI]      = oRhs.word_ranks[iI];
	}
}

Passage & Passage::operator =(const Passage & oRhs)
{
	if (this != &oRhs)
	{
		positions = oRhs.positions;
		rank      = oRhs.rank;
		idf       = oRhs.idf;

		min_bp_pos = oRhs.min_bp_pos;
		max_bp_pos = oRhs.max_bp_pos;

		if (max_pos != oRhs.max_pos)
		{
			max_pos   = oRhs.max_pos;

			delete [] base_points_pos;
			delete [] word_ranks;

			base_points_pos = new UINT_32[max_pos];
			word_ranks      = new W_FLOAT[max_pos];
		}

		for (UINT_32 iI = 0; iI < max_pos; ++iI)
		{
			base_points_pos[iI] = oRhs.base_points_pos[iI];
			word_ranks[iI]      = oRhs.word_ranks[iI];
		}
	}
	return *this;
}

} // namespace FTSS
// End.
